Information search as a document heuristic factor
نویسندگان
چکیده
منابع مشابه
Document Image Decoding by Heuristic Search
This correspondence describes an approach to reducing the computational cost of document image decoding by viewing it as a heuristic search problem. The kernel of the approach is a modi ed dynamic programming (DP) algorithm, called the iterated complete path (ICP) algorithm, that is intended for use with separable source models. A set of heuristic functions are presented for decoding formatted ...
متن کاملDecomposing Document Images by Heuristic Search
Document decomposition is a basic but crucial step for many document related applications. This paper proposes a novel approach to decompose document images into zones. It first generates overlapping zone hypotheses based on generic visual features. Then, each candidate zone is evaluated quantitatively by a learned generative zone model. We infer the optimal set of non-overlapping zones that co...
متن کاملPlanning as heuristic search
In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics from Strips encodings. They differ from specialized problem solvers such as those developed for the 24-Puz...
متن کاملPlanning with Incomplete Information as Heuristic Search in Belief Space
The [ornntlation of planning as heuristk: search with heuristics derived from problem representations ]nas turned out to be a fruitful approach for cla..,...ical planning. In this paper, we, pur.,,ue a sinnilar idea in Ihe context pLa.nning with incomplete inh)rmation. Planning with incomphit.e iTnforntalion can be formulatvd as a pmbh’nt of search in &.liqf space, where b(l&f stat~ can be ell ...
متن کاملExploiting Problem Structure as a Search Heuristic
Recent empirical and theoretical studies have shown that simple parameters characterizing constraint satisfaction problems predict whether they have a solution and the cost to solve them, on average. This paper examines the effectiveness of using these predictions as a heuristic for solving the graph coloring problem. Specifically, by adding some global information on the consequences of variou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Education a New Dimension
سال: 2018
ISSN: 2308-5258,2308-1996
DOI: 10.31174/send-hs2018-178vi29-20